The Categorical Multi-Combinator Machine: CMCM
نویسندگان
چکیده
منابع مشابه
The Categorical Multi-Combinator Machine: CMCM
Implementations of functional programming languages can take a number of different forms; the first implementations used the SECD machine of Landin [Lan], which is a generalisation of the abstract machine underlying implementations of imperative programming languages like Pascal. Making the implementation lazy can be done with some cost in efficiency (details can be found in Henderson’s book [H...
متن کاملCategorical abstract machine pdf
The machine is called categorical abstract machine or CAM. The CAM is easier to grasp and prove than the SECD machine. The natural.of such a language and an abstract machine is needed to have a certified. Then we define a bulk synchronous parallel categorical abstract machine and the.Abstract. Data-parallel ML is proposed for compilation to a distributed version DPCAM of Cousineau, Curien and M...
متن کاملThe Data-Parallel Categorical Abstract Machine
Data-parallel ML is proposed for compilation to a distributed version (DPCAM) of Cousineau, Curien and Mauny's Categorical Abstract Machine. The DPCAM is a static network of CAMs which dynamically restrict the MIMD execution mode: nodes execute the same program and communicate only while executing the same function body. Programs violating this restriction or exhibiting unbounded spatial recurs...
متن کاملMulti-field Categorical Data
This paper presents a method of learning distributed representation for multi-field categorical data, which is a common data format with various applications such as recommender systems, social link prediction, and computational advertising. The success of non-linear models, e.g., factorisation machines, boosted trees, has proved the potential of exploring the interactions among inter-field cat...
متن کاملThe Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and effective formalization of corecursive values, recursive and corecursive functions, as well as functions mixing recursion and corecursion. It supports higher-order recursion, nested recursion, and offers a proper treatment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.2.170